Adding Number Restrictions to a Four-Valued Terminological Logic

نویسنده

  • Peter F. Patel-Schneider
چکیده

An intuitive four-valued semantics can be used to develop expressively powerful terminological logits which have tractable subsumption. If a fourvalued identity is also used, number restrictions can be added to the logic while retaining tracts bility. The subsumptions supported by the logic are a type of “structural” subsumption, where each structural component of one concept must have an analogue in the other concept. Structural subsumption captures an important set of subsumptions, similar to the subsumptions computed in KL-ONE and NIKL. This shows that the trade-off between expressive power and computational tractability which plagues terminological logics based on standard, two-valued semantics can be defeated while still retaining a useful and semantically supported set of subsumptions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Tractability of Terminological Logics with Numerical Restrictions

A number of results relative to the complexity of terminological logics have recently appeared in the literature. Unfortunately, most of these results are “negative”, as they show that, in the logics they refer to, deciding subsumption is intractable. In this paper we show that computing subsumption is O(n2) in B∇ac〈ma\∀4N−, a logic obtained by adding the two operators atleast and atmost, which...

متن کامل

Non-Invasive Brain-Actuated Control of a Mobile Robot

We review and extend earlier work on the logic CFD, a description logic that allows terminological cycles with universal restrictions over functional roles. In particular, we consider the problem of reasoning about concept subsumption and the problem of computing certain answers for a family of attribute-connected conjunctive queries, showing that both problems are in PTIME. We then consider th...

متن کامل

Applications and Extensions of PTIME Description Logics with Functional Constraints

We review and extend earlier work on the logic CFD, a description logic that allows terminological cycles with universal restrictions over functional roles. In particular, we consider the problem of reasoning about concept subsumption and the problem of computing certain answers for a family of attribute-connected conjunctive queries, showing that both problems are in PTIME. We then consider th...

متن کامل

Terminological Cycles in a Description Logic with Existential Restrictions

Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This paper investigates subsumption in the presence of terminological cycles fo...

متن کامل

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988